Efficient Quantum Transforms
نویسنده
چکیده
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform. New networks for two wavelet transforms are given. Quantum computation of Fourier transforms for non-Abelian groups is defined. A slightly relaxed definition is shown to simplify the analysis and the networks that computes the transforms. Efficient networks for computing such transforms for a class of metacyclic groups are introduced. A novel network for computing a Fourier transform for a group used in quantum errorcorrection is also given.
منابع مشابه
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms, the wavelet transforms, which are every bit as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal an...
متن کاملQuantum Fourier transforms for extracting hidden linear structures in finite fields ∗
We propose a definition for quantum Fourier transforms in settings where the algebraic structure is that of a finite field, and show that they can be performed efficiently by a quantum computer. Using these finite field quantum Fourier transforms, we obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a problem that requires Ω(2) ...
متن کاملQuantum Time-Frequency Transforms
Time-frequency transforms represent a signal as a mixture of its time domain representation and its frequency domain representation. We present efficient algorithms for the quantum Zak transform and quantum Weyl-Heisenberg transform.
متن کاملOn the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log N) elementary quantum gates are necessary to i...
متن کاملQIP Note: On the Quantum Fourier Transform and Applications
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any efficiently computable periodic function. This in particular implies an efficient quantum algorithm for factoring. In the appendix we show how this generalizes to solving the hidden subgroup problem in any Abelian group. Efficient quantum algorithms for discrete log (and ...
متن کامل